Edge-Ends in Countable Graphs
نویسندگان
چکیده
منابع مشابه
Edge-Ends in Countable Graphs
The notion of ends equivalence classes on the set of rays (one-way infinite paths) of a graph is one of the most studied topics in infinite graph theory. An introduction to this theory and basic results can be found in Halin [3]. Halin defined two rays to be equivalent if no finite set of vertices can separate an infinite part of the first ray from an infinite part of the second one. In particu...
متن کاملEdge-Magic Group Labellings of Countable Graphs
We investigate the existence of edge-magic labellings of countably infinite graphs by abelian groups. We show for that for a large class of abelian groups, including the integers Z, there is such a labelling whenever the graph has an infinite set of disjoint edges. A graph without an infinite set of disjoint edges must be some subgraph of H + I, where H is some finite graph and I is a countable...
متن کاملSpanning trees of countable graphs omitting sets of dominated ends
Generalizing the well-known theorem of Halin (1964) that a countable connected graph G contains an end-faithful spanning tree (i.e., an end-preserving tree that omits no end of G), we establish some results about the existence of end-preserving spanning trees omitting some prescribed set of ends. We remark that if such a tree exists, the omitted ends must all be dominated, and even then counter...
متن کاملThe Erdős-Menger conjecture with ends in arbitrary graphs with countable separators
A well-known conjecture of Erdős states that, given an infinite graph G, and sets A,B ⊆ V (G), there exists a family of disjoint A–B paths P together with an A–B separator X consisting of a choice of one vertex from each path in P. There is a natural extension of this conjecture in which A, B and X may contain ends as well as vertices. We prove this extension for sets A and B that can be separa...
متن کاملThe countable Erds-Menger conjecture with ends
Erd˝ os conjectured that, given an infinite graph G and vertex sets A, B ⊆ V (G), there exist a set P of disjoint A–B paths in G and an A–B separator X 'on' P, in the sense that X consists of a choice of one vertex from each path in P. We prove, for countable graphs G, the extension of this conjecture in which A, B and X are allowed to contain ends as well as vertices, and where the closure of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1997
ISSN: 0095-8956
DOI: 10.1006/jctb.1996.1734